A q - analogue of the distance matrix of a tree 1
نویسندگان
چکیده
R. B. Bapat 2 A. K. Lal3 Sukanta Pati 4 Abstract We consider a q-analogue of the distance matrix (called the q-distance matrix) of an unweighted tree and give formulae for the inverse and the determinant, which generalize the existing formulae for the distance matrix. We obtain the Smith normal form of the q-distance matrix of a tree. The relationship of the q-distance matrix with the Laplacian matrix leads to q-analogue of the Laplacian matrix of a tree, some of whose properties are also given. We study another matrix related to the distance matrix (the exponential distance matrix) and show its relationship with the q-Laplacian and the q-distance matrix. A formula for the determinant of the q-distance matrix of a weighted tree is also given.
منابع مشابه
Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملOn the spectra of reduced distance matrix of the generalized Bethe trees
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
متن کاملThe Product Distance Matrix of a Tree and a Bivariate Zeta Function of a Graph∗
We define the product distance matrix of a tree and obtain formulas for its determinant and inverse. The results generalize known formulas for the exponential distance matrix. When we restrict the number of variables to two, we are naturally led to define a bivariate analogue of the laplacian matrix of an arbitrary graph. We also define a bivariate analogue of the Ihara-Selberg zeta function an...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملA q-Analogue of Graham, Hoffman and Hosoya's Theorem
Graham, Hoffman and Hosoya gave a very nice formula about the determinant of the distance matrix DG of a graph G in terms of the distance matrix of its blocks. We generalize this result to a q-analogue of DG. Our generalization yields results about the equality of the determinant of the mod-2 (and in general mod-k) distance matrix (i.e. each entry of the distance matrix is taken modulo 2 or k) ...
متن کامل